Dynamic optimization for functional reactive programming using generalized algebraic data types
نویسندگان
چکیده
منابع مشابه
Dynamic Programming for Set Data Types
We present an efficient generalization of algebraic dynamic programming (ADP) to unordered data types and a formalism for the automated derivation of outside grammars from their inside progenitors. These theoretical contributions are illustrated by ADP-style algorithms for shortest Hamiltonian path problems. These arise naturally when asking whether the evolutionary history of an ancient gene c...
متن کاملAlgebraic effects for Functional Programming
Algebraic effect handlers, are recently gaining in popularity as a purely functional approach to modeling effects. In this article, we give an end-to-end overview of practical algebraic effects in the context of a compiled implementation in the Koka language. In particular, we show how algebraic effects generalize over common constructs like exception handling, state, iterators and async-await....
متن کاملTyping ZINC Machine with Generalized Algebraic Data Types
The Krivine-style evaluation mechanism is well-known in the implementation of higher-order functions, allowing to avoid some useless closure building. There have been a few type systems that can verify the safety of the mechanism. The incorporation of the proposed ideas into an existing compiler, however, would require significant changes in the type system of the compiler due to the use of som...
متن کاملDynamic Programming for Set Data Types Electronic Supplement
A good example for Dynamic Programming over sequences is RNA folding. We consider here only a minimal example based on the grammar with non-terminals S and B denoting arbitrary structures and secondary structures enclosed by a base pair respectively. We write terminals in the usual shorthand notation as • for an unpaired base, while ( and ) denotes a base pair. There are just five productions i...
متن کاملAlgebraic Dynamic Programming 2.0
Haskell has played a major role – and it still does – in the implementation of the Algebraic Dynamic Programming framework as it emerged about a decade ago. Here, we present a—yet unpublished— generalization of the ADP framework which also accomodates problems on trees. The new framework is not an “add-on” extension, but suggests a reformulation of “classical” ADP. ADP 2.0 is not only more gene...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: ACM SIGPLAN Notices
سال: 2005
ISSN: 0362-1340,1558-1160
DOI: 10.1145/1090189.1086374